0.06/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM 0.11/0.33 % Computer : n001.cluster.edu 0.11/0.33 % Model : x86_64 x86_64 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.33 % Memory : 8042.1875MB 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.33 % CPULimit : 1920 0.11/0.33 % WCLimit : 240 0.11/0.33 % DateTime : Wed Jul 30 06:03:04 EDT 2025 0.11/0.33 % CPUTime : 0.19/0.48 Running higher-order theorem proving 0.19/0.52 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.qYgOJOCv3H/E---3.1_31022.p 0.64/0.68 # Version: 3.0.0-ho 0.64/0.68 # Preprocessing class: HSLSSMSMSSSCHFA. 0.64/0.68 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.64/0.68 # Starting lpo5_fix with 1200s (5) cores 0.64/0.68 # Starting lpo6_lambda_fix with 240s (1) cores 0.64/0.68 # Starting post_as_ho8 with 240s (1) cores 0.64/0.68 # Starting lpo5_rw_fix with 240s (1) cores 0.64/0.68 # lpo5_rw_fix with pid 31103 completed with status 0 0.64/0.68 # Result found by lpo5_rw_fix 0.64/0.68 # Preprocessing class: HSLSSMSMSSSCHFA. 0.64/0.68 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.64/0.68 # Starting lpo5_fix with 1200s (5) cores 0.64/0.68 # Starting lpo6_lambda_fix with 240s (1) cores 0.64/0.68 # Starting post_as_ho8 with 240s (1) cores 0.64/0.68 # Starting lpo5_rw_fix with 240s (1) cores 0.64/0.68 # SinE strategy is gf120_gu_RUU_F100_L01000 0.64/0.68 # Search class: HGUSM-FSLM31-MHFFFSBN 0.64/0.68 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.64/0.68 # Starting lpo8_lambda_fix with 130s (1) cores 0.64/0.68 # lpo8_lambda_fix with pid 31105 completed with status 0 0.64/0.68 # Result found by lpo8_lambda_fix 0.64/0.68 # Preprocessing class: HSLSSMSMSSSCHFA. 0.64/0.68 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.64/0.68 # Starting lpo5_fix with 1200s (5) cores 0.64/0.68 # Starting lpo6_lambda_fix with 240s (1) cores 0.64/0.68 # Starting post_as_ho8 with 240s (1) cores 0.64/0.68 # Starting lpo5_rw_fix with 240s (1) cores 0.64/0.68 # SinE strategy is gf120_gu_RUU_F100_L01000 0.64/0.68 # Search class: HGUSM-FSLM31-MHFFFSBN 0.64/0.68 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.64/0.68 # Starting lpo8_lambda_fix with 130s (1) cores 0.64/0.68 # Preprocessing time : 0.010 s 0.64/0.68 # Presaturation interreduction done 0.64/0.68 0.64/0.68 # Proof found! 0.64/0.68 # SZS status Theorem 0.64/0.68 # SZS output start CNFRefutation 0.64/0.68 thf(decl_sort1, type, multiset_a: $tType). 0.64/0.68 thf(decl_sort2, type, tree_a: $tType). 0.64/0.68 thf(decl_sort3, type, a: $tType). 0.64/0.68 thf(decl_23, type, plus_plus_multiset_a: multiset_a > multiset_a > multiset_a). 0.64/0.68 thf(decl_24, type, zero_zero_multiset_a: multiset_a). 0.64/0.68 thf(decl_28, type, heapIm1140443833left_a: tree_a > tree_a). 0.64/0.68 thf(decl_31, type, heapIm1257206334ight_a: tree_a > tree_a). 0.64/0.68 thf(decl_32, type, heapIm1091024090Down_a: tree_a > tree_a). 0.64/0.68 thf(decl_36, type, t_a: a > tree_a > tree_a > tree_a). 0.64/0.68 thf(decl_39, type, multiset_a2: tree_a > multiset_a). 0.64/0.68 thf(decl_40, type, val_a: tree_a > a). 0.64/0.68 thf(decl_43, type, add_mset_a: a > multiset_a > multiset_a). 0.64/0.68 thf(decl_51, type, ord_less_eq_a: a > a > $o). 0.64/0.68 thf(decl_63, type, l1: tree_a). 0.64/0.68 thf(decl_64, type, l2: tree_a). 0.64/0.68 thf(decl_65, type, r1: tree_a). 0.64/0.68 thf(decl_66, type, r2: tree_a). 0.64/0.68 thf(decl_67, type, v1: a). 0.64/0.68 thf(decl_68, type, v2: a). 0.64/0.68 thf(decl_69, type, v: a). 0.64/0.68 thf(conj_0, conjecture, ((multiset_a2 @ (heapIm1091024090Down_a @ (t_a @ v @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2))))=(multiset_a2 @ (t_a @ v @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2)))), file('/export/starexec/sandbox/tmp/tmp.qYgOJOCv3H/E---3.1_31022.p', conj_0)). 0.64/0.68 thf(fact_153_multiset_Osimps_I2_J, axiom, ![X24:a, X58:tree_a, X107:tree_a]:(((multiset_a2 @ (t_a @ X24 @ X58 @ X107))=(plus_plus_multiset_a @ (plus_plus_multiset_a @ (multiset_a2 @ X58) @ (add_mset_a @ X24 @ zero_zero_multiset_a)) @ (multiset_a2 @ X107)))), file('/export/starexec/sandbox/tmp/tmp.qYgOJOCv3H/E---3.1_31022.p', fact_153_multiset_Osimps_I2_J)). 0.64/0.68 thf(fact_172_union__assoc, axiom, ![X36:multiset_a, X37:multiset_a, X35:multiset_a]:(((plus_plus_multiset_a @ (plus_plus_multiset_a @ X36 @ X37) @ X35)=(plus_plus_multiset_a @ X36 @ (plus_plus_multiset_a @ X37 @ X35)))), file('/export/starexec/sandbox/tmp/tmp.qYgOJOCv3H/E---3.1_31022.p', fact_172_union__assoc)). 0.64/0.68 thf(fact_174_union__commute, axiom, ((plus_plus_multiset_a)=(^[X292:multiset_a, X293:multiset_a]:(plus_plus_multiset_a @ X293 @ X292))), file('/export/starexec/sandbox/tmp/tmp.qYgOJOCv3H/E---3.1_31022.p', fact_174_union__commute)). 0.64/0.68 thf(fact_32_siftDown_Osimps_I6_J, axiom, ![X21:a, X22:tree_a, X23:tree_a, X265:a, X266:tree_a, X267:tree_a, X24:a]:((((((ord_less_eq_a @ (val_a @ (t_a @ X265 @ X266 @ X267)) @ X24)=>((heapIm1091024090Down_a @ (t_a @ X24 @ (t_a @ X265 @ X266 @ X267) @ (t_a @ X21 @ X22 @ X23)))=(t_a @ X24 @ (t_a @ X265 @ X266 @ X267) @ (t_a @ X21 @ X22 @ X23))))&(~((ord_less_eq_a @ (val_a @ (t_a @ X265 @ X266 @ X267)) @ X24))=>((heapIm1091024090Down_a @ (t_a @ X24 @ (t_a @ X265 @ X266 @ X267) @ (t_a @ X21 @ X22 @ X23)))=(t_a @ (val_a @ (t_a @ X265 @ X266 @ X267)) @ (heapIm1091024090Down_a @ (t_a @ X24 @ (heapIm1140443833left_a @ (t_a @ X265 @ X266 @ X267)) @ (heapIm1257206334ight_a @ (t_a @ X265 @ X266 @ X267)))) @ (t_a @ X21 @ X22 @ X23)))))<=(ord_less_eq_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ (val_a @ (t_a @ X265 @ X266 @ X267))))&((((ord_less_eq_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ X24)=>((heapIm1091024090Down_a @ (t_a @ X24 @ (t_a @ X265 @ X266 @ X267) @ (t_a @ X21 @ X22 @ X23)))=(t_a @ X24 @ (t_a @ X265 @ X266 @ X267) @ (t_a @ X21 @ X22 @ X23))))&(((heapIm1091024090Down_a @ (t_a @ X24 @ (t_a @ X265 @ X266 @ X267) @ (t_a @ X21 @ X22 @ X23)))=(t_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ (t_a @ X265 @ X266 @ X267) @ (heapIm1091024090Down_a @ (t_a @ X24 @ (heapIm1140443833left_a @ (t_a @ X21 @ X22 @ X23)) @ (heapIm1257206334ight_a @ (t_a @ X21 @ X22 @ X23))))))<=~((ord_less_eq_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ X24))))<=~((ord_less_eq_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ (val_a @ (t_a @ X265 @ X266 @ X267))))))), file('/export/starexec/sandbox/tmp/tmp.qYgOJOCv3H/E---3.1_31022.p', fact_32_siftDown_Osimps_I6_J)). 0.64/0.68 thf(fact_173_union__lcomm, axiom, ![X36:multiset_a, X37:multiset_a, X35:multiset_a]:(((plus_plus_multiset_a @ X36 @ (plus_plus_multiset_a @ X37 @ X35))=(plus_plus_multiset_a @ X37 @ (plus_plus_multiset_a @ X36 @ X35)))), file('/export/starexec/sandbox/tmp/tmp.qYgOJOCv3H/E---3.1_31022.p', fact_173_union__lcomm)). 0.64/0.68 thf(fact_30_val_Osimps, axiom, ![X24:a, X228:tree_a, X229:tree_a]:(((val_a @ (t_a @ X24 @ X228 @ X229))=(X24))), file('/export/starexec/sandbox/tmp/tmp.qYgOJOCv3H/E---3.1_31022.p', fact_30_val_Osimps)). 0.64/0.68 thf(fact_1_True, axiom, (ord_less_eq_a @ v1 @ v), file('/export/starexec/sandbox/tmp/tmp.qYgOJOCv3H/E---3.1_31022.p', fact_1_True)). 0.64/0.68 thf(fact_0__092_060open_062v2_A_092_060le_062_Av1_092_060close_062, axiom, (ord_less_eq_a @ v2 @ v1), file('/export/starexec/sandbox/tmp/tmp.qYgOJOCv3H/E---3.1_31022.p', fact_0__092_060open_062v2_A_092_060le_062_Av1_092_060close_062)). 0.64/0.68 thf(c_0_9, negated_conjecture, ((multiset_a2 @ (heapIm1091024090Down_a @ (t_a @ v @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2))))!=(multiset_a2 @ (t_a @ v @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.64/0.68 thf(c_0_10, plain, ![X834:a, X835:tree_a, X836:tree_a]:(((multiset_a2 @ (t_a @ X834 @ X835 @ X836))=(plus_plus_multiset_a @ (plus_plus_multiset_a @ (multiset_a2 @ X835) @ (add_mset_a @ X834 @ zero_zero_multiset_a)) @ (multiset_a2 @ X836)))), inference(variable_rename,[status(thm)],[fact_153_multiset_Osimps_I2_J])). 0.64/0.68 thf(c_0_11, plain, ![X1011:multiset_a, X1012:multiset_a, X1013:multiset_a]:(((plus_plus_multiset_a @ (plus_plus_multiset_a @ X1011 @ X1012) @ X1013)=(plus_plus_multiset_a @ X1011 @ (plus_plus_multiset_a @ X1012 @ X1013)))), inference(variable_rename,[status(thm)],[fact_172_union__assoc])). 0.64/0.68 thf(c_0_12, plain, ![X822:multiset_a, X823:multiset_a]:(((plus_plus_multiset_a @ X822 @ X823)=(plus_plus_multiset_a @ X823 @ X822))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_174_union__commute])])). 0.64/0.68 thf(c_0_13, negated_conjecture, ((multiset_a2 @ (heapIm1091024090Down_a @ (t_a @ v @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2))))!=(multiset_a2 @ (t_a @ v @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2)))), inference(fof_nnf,[status(thm)],[c_0_9])). 0.64/0.68 thf(c_0_14, plain, ![X1:a, X2:tree_a, X4:tree_a]:(((multiset_a2 @ (t_a @ X1 @ X2 @ X4))=(plus_plus_multiset_a @ (plus_plus_multiset_a @ (multiset_a2 @ X2) @ (add_mset_a @ X1 @ zero_zero_multiset_a)) @ (multiset_a2 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_10])). 0.64/0.68 thf(c_0_15, plain, ![X13:multiset_a, X14:multiset_a, X15:multiset_a]:(((plus_plus_multiset_a @ (plus_plus_multiset_a @ X13 @ X14) @ X15)=(plus_plus_multiset_a @ X13 @ (plus_plus_multiset_a @ X14 @ X15)))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.64/0.68 thf(c_0_16, plain, ![X1009:multiset_a, X1010:multiset_a]:(((plus_plus_multiset_a @ X1009 @ X1010)=(plus_plus_multiset_a @ X1010 @ X1009))), inference(variable_rename,[status(thm)],[c_0_12])). 0.64/0.68 thf(c_0_17, plain, ![X21:a, X22:tree_a, X23:tree_a, X265:a, X266:tree_a, X267:tree_a, X24:a]:((((ord_less_eq_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ (val_a @ (t_a @ X265 @ X266 @ X267)))=>(((ord_less_eq_a @ (val_a @ (t_a @ X265 @ X266 @ X267)) @ X24)=>((heapIm1091024090Down_a @ (t_a @ X24 @ (t_a @ X265 @ X266 @ X267) @ (t_a @ X21 @ X22 @ X23)))=(t_a @ X24 @ (t_a @ X265 @ X266 @ X267) @ (t_a @ X21 @ X22 @ X23))))&(~(ord_less_eq_a @ (val_a @ (t_a @ X265 @ X266 @ X267)) @ X24)=>((heapIm1091024090Down_a @ (t_a @ X24 @ (t_a @ X265 @ X266 @ X267) @ (t_a @ X21 @ X22 @ X23)))=(t_a @ (val_a @ (t_a @ X265 @ X266 @ X267)) @ (heapIm1091024090Down_a @ (t_a @ X24 @ (heapIm1140443833left_a @ (t_a @ X265 @ X266 @ X267)) @ (heapIm1257206334ight_a @ (t_a @ X265 @ X266 @ X267)))) @ (t_a @ X21 @ X22 @ X23))))))&(~(ord_less_eq_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ (val_a @ (t_a @ X265 @ X266 @ X267)))=>(((ord_less_eq_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ X24)=>((heapIm1091024090Down_a @ (t_a @ X24 @ (t_a @ X265 @ X266 @ X267) @ (t_a @ X21 @ X22 @ X23)))=(t_a @ X24 @ (t_a @ X265 @ X266 @ X267) @ (t_a @ X21 @ X22 @ X23))))&(~(ord_less_eq_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ X24)=>((heapIm1091024090Down_a @ (t_a @ X24 @ (t_a @ X265 @ X266 @ X267) @ (t_a @ X21 @ X22 @ X23)))=(t_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ (t_a @ X265 @ X266 @ X267) @ (heapIm1091024090Down_a @ (t_a @ X24 @ (heapIm1140443833left_a @ (t_a @ X21 @ X22 @ X23)) @ (heapIm1257206334ight_a @ (t_a @ X21 @ X22 @ X23))))))))))), inference(fof_simplification,[status(thm)],[fact_32_siftDown_Osimps_I6_J])). 0.64/0.68 thf(c_0_18, negated_conjecture, ((multiset_a2 @ (heapIm1091024090Down_a @ (t_a @ v @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2))))!=(multiset_a2 @ (t_a @ v @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2)))), inference(split_conjunct,[status(thm)],[c_0_13])). 0.64/0.68 thf(c_0_19, plain, ![X1:a, X2:tree_a, X4:tree_a]:(((multiset_a2 @ (t_a @ X1 @ X2 @ X4))=(plus_plus_multiset_a @ (multiset_a2 @ X2) @ (plus_plus_multiset_a @ (add_mset_a @ X1 @ zero_zero_multiset_a) @ (multiset_a2 @ X4))))), inference(rw,[status(thm)],[c_0_14, c_0_15])). 0.64/0.68 thf(c_0_20, plain, ![X14:multiset_a, X13:multiset_a]:(((plus_plus_multiset_a @ X13 @ X14)=(plus_plus_multiset_a @ X14 @ X13))), inference(split_conjunct,[status(thm)],[c_0_16])). 0.64/0.68 thf(c_0_21, plain, ![X1000:multiset_a, X1001:multiset_a, X1002:multiset_a]:(((plus_plus_multiset_a @ X1000 @ (plus_plus_multiset_a @ X1001 @ X1002))=(plus_plus_multiset_a @ X1001 @ (plus_plus_multiset_a @ X1000 @ X1002)))), inference(variable_rename,[status(thm)],[fact_173_union__lcomm])). 0.64/0.68 thf(c_0_22, plain, ![X1216:a, X1217:tree_a, X1218:tree_a, X1219:a, X1220:tree_a, X1221:tree_a, X1222:a]:((((~(ord_less_eq_a @ (val_a @ (t_a @ X1219 @ X1220 @ X1221)) @ X1222)|((heapIm1091024090Down_a @ (t_a @ X1222 @ (t_a @ X1219 @ X1220 @ X1221) @ (t_a @ X1216 @ X1217 @ X1218)))=(t_a @ X1222 @ (t_a @ X1219 @ X1220 @ X1221) @ (t_a @ X1216 @ X1217 @ X1218)))|~(ord_less_eq_a @ (val_a @ (t_a @ X1216 @ X1217 @ X1218)) @ (val_a @ (t_a @ X1219 @ X1220 @ X1221))))&((ord_less_eq_a @ (val_a @ (t_a @ X1219 @ X1220 @ X1221)) @ X1222)|((heapIm1091024090Down_a @ (t_a @ X1222 @ (t_a @ X1219 @ X1220 @ X1221) @ (t_a @ X1216 @ X1217 @ X1218)))=(t_a @ (val_a @ (t_a @ X1219 @ X1220 @ X1221)) @ (heapIm1091024090Down_a @ (t_a @ X1222 @ (heapIm1140443833left_a @ (t_a @ X1219 @ X1220 @ X1221)) @ (heapIm1257206334ight_a @ (t_a @ X1219 @ X1220 @ X1221)))) @ (t_a @ X1216 @ X1217 @ X1218)))|~(ord_less_eq_a @ (val_a @ (t_a @ X1216 @ X1217 @ X1218)) @ (val_a @ (t_a @ X1219 @ X1220 @ X1221)))))&((~(ord_less_eq_a @ (val_a @ (t_a @ X1216 @ X1217 @ X1218)) @ X1222)|((heapIm1091024090Down_a @ (t_a @ X1222 @ (t_a @ X1219 @ X1220 @ X1221) @ (t_a @ X1216 @ X1217 @ X1218)))=(t_a @ X1222 @ (t_a @ X1219 @ X1220 @ X1221) @ (t_a @ X1216 @ X1217 @ X1218)))|(ord_less_eq_a @ (val_a @ (t_a @ X1216 @ X1217 @ X1218)) @ (val_a @ (t_a @ X1219 @ X1220 @ X1221))))&((ord_less_eq_a @ (val_a @ (t_a @ X1216 @ X1217 @ X1218)) @ X1222)|((heapIm1091024090Down_a @ (t_a @ X1222 @ (t_a @ X1219 @ X1220 @ X1221) @ (t_a @ X1216 @ X1217 @ X1218)))=(t_a @ (val_a @ (t_a @ X1216 @ X1217 @ X1218)) @ (t_a @ X1219 @ X1220 @ X1221) @ (heapIm1091024090Down_a @ (t_a @ X1222 @ (heapIm1140443833left_a @ (t_a @ X1216 @ X1217 @ X1218)) @ (heapIm1257206334ight_a @ (t_a @ X1216 @ X1217 @ X1218))))))|(ord_less_eq_a @ (val_a @ (t_a @ X1216 @ X1217 @ X1218)) @ (val_a @ (t_a @ X1219 @ X1220 @ X1221))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])). 0.64/0.68 thf(c_0_23, plain, ![X1183:a, X1184:tree_a, X1185:tree_a]:(((val_a @ (t_a @ X1183 @ X1184 @ X1185))=(X1183))), inference(variable_rename,[status(thm)],[fact_30_val_Osimps])). 0.64/0.68 thf(c_0_24, negated_conjecture, ((multiset_a2 @ (heapIm1091024090Down_a @ (t_a @ v @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2))))!=(plus_plus_multiset_a @ (multiset_a2 @ l1) @ (plus_plus_multiset_a @ (add_mset_a @ v1 @ zero_zero_multiset_a) @ (plus_plus_multiset_a @ (add_mset_a @ v @ zero_zero_multiset_a) @ (plus_plus_multiset_a @ (multiset_a2 @ l2) @ (plus_plus_multiset_a @ (add_mset_a @ v2 @ zero_zero_multiset_a) @ (plus_plus_multiset_a @ (multiset_a2 @ r2) @ (multiset_a2 @ r1)))))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_19]), c_0_19]), c_0_19]), c_0_15]), c_0_15]), c_0_20]), c_0_15]), c_0_15]), c_0_15])). 0.64/0.68 thf(c_0_25, plain, ![X13:multiset_a, X14:multiset_a, X15:multiset_a]:(((plus_plus_multiset_a @ X13 @ (plus_plus_multiset_a @ X14 @ X15))=(plus_plus_multiset_a @ X14 @ (plus_plus_multiset_a @ X13 @ X15)))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.64/0.68 thf(c_0_26, plain, ![X1:a, X3:a, X2:tree_a, X5:a, X23:tree_a, X22:tree_a, X4:tree_a]:((((heapIm1091024090Down_a @ (t_a @ X3 @ (t_a @ X1 @ X2 @ X4) @ (t_a @ X5 @ X22 @ X23)))=(t_a @ X3 @ (t_a @ X1 @ X2 @ X4) @ (t_a @ X5 @ X22 @ X23)))|~((ord_less_eq_a @ (val_a @ (t_a @ X1 @ X2 @ X4)) @ X3))|~((ord_less_eq_a @ (val_a @ (t_a @ X5 @ X22 @ X23)) @ (val_a @ (t_a @ X1 @ X2 @ X4)))))), inference(split_conjunct,[status(thm)],[c_0_22])). 0.64/0.68 thf(c_0_27, plain, ![X4:tree_a, X2:tree_a, X1:a]:(((val_a @ (t_a @ X1 @ X2 @ X4))=(X1))), inference(split_conjunct,[status(thm)],[c_0_23])). 0.64/0.68 thf(c_0_28, negated_conjecture, ((multiset_a2 @ (heapIm1091024090Down_a @ (t_a @ v @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2))))!=(plus_plus_multiset_a @ (add_mset_a @ v1 @ zero_zero_multiset_a) @ (plus_plus_multiset_a @ (add_mset_a @ v2 @ zero_zero_multiset_a) @ (plus_plus_multiset_a @ (add_mset_a @ v @ zero_zero_multiset_a) @ (plus_plus_multiset_a @ (multiset_a2 @ l2) @ (plus_plus_multiset_a @ (multiset_a2 @ r2) @ (plus_plus_multiset_a @ (multiset_a2 @ l1) @ (multiset_a2 @ r1)))))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24, c_0_25]), c_0_25]), c_0_25]), c_0_25]), c_0_25]), c_0_25]), c_0_25])). 0.64/0.68 thf(c_0_29, plain, ![X1:a, X2:tree_a, X4:tree_a, X23:tree_a, X22:tree_a, X5:a, X3:a]:((((heapIm1091024090Down_a @ (t_a @ X1 @ (t_a @ X3 @ X2 @ X4) @ (t_a @ X5 @ X22 @ X23)))=(t_a @ X1 @ (t_a @ X3 @ X2 @ X4) @ (t_a @ X5 @ X22 @ X23)))|~((ord_less_eq_a @ X3 @ X1))|~((ord_less_eq_a @ X5 @ X3)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26, c_0_27]), c_0_27]), c_0_27])). 0.64/0.68 thf(c_0_30, plain, (ord_less_eq_a @ v1 @ v), inference(split_conjunct,[status(thm)],[fact_1_True])). 0.64/0.68 thf(c_0_31, plain, (ord_less_eq_a @ v2 @ v1), inference(split_conjunct,[status(thm)],[fact_0__092_060open_062v2_A_092_060le_062_Av1_092_060close_062])). 0.64/0.68 thf(c_0_32, plain, ![X14:multiset_a, X13:multiset_a]:(((plus_plus_multiset_a @ X13 @ X14)=(plus_plus_multiset_a @ X14 @ X13))), c_0_20). 0.64/0.68 thf(c_0_33, plain, ![X13:multiset_a, X14:multiset_a, X15:multiset_a]:(((plus_plus_multiset_a @ (plus_plus_multiset_a @ X13 @ X14) @ X15)=(plus_plus_multiset_a @ X13 @ (plus_plus_multiset_a @ X14 @ X15)))), c_0_15). 0.64/0.68 thf(c_0_34, negated_conjecture, ($false), inference(ar,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_19]), c_0_19]), c_0_19]), c_0_15]), c_0_15]), c_0_20]), c_0_15]), c_0_15]), c_0_15]), c_0_25]), c_0_25]), c_0_30]), c_0_31])]), c_0_32, c_0_33]), ['proof']). 0.64/0.68 # SZS output end CNFRefutation 0.64/0.68 # Parsed axioms : 269 0.64/0.68 # Removed by relevancy pruning/SinE : 138 0.64/0.68 # Initial clauses : 367 0.64/0.68 # Removed in clause preprocessing : 12 0.64/0.68 # Initial clauses in saturation : 355 0.64/0.68 # Processed clauses : 1359 0.64/0.68 # ...of these trivial : 24 0.64/0.68 # ...subsumed : 812 0.64/0.68 # ...remaining for further processing : 523 0.64/0.68 # Other redundant clauses eliminated : 174 0.64/0.68 # Clauses deleted for lack of memory : 0 0.64/0.68 # Backward-subsumed : 3 0.64/0.68 # Backward-rewritten : 3 0.64/0.68 # Generated clauses : 3018 0.64/0.68 # ...of the previous two non-redundant : 2582 0.64/0.68 # ...aggressively subsumed : 0 0.64/0.68 # Contextual simplify-reflections : 2 0.64/0.68 # Paramodulations : 2789 0.64/0.68 # Factorizations : 4 0.64/0.68 # NegExts : 0 0.64/0.68 # Equation resolutions : 188 0.64/0.68 # Disequality decompositions : 0 0.64/0.68 # Total rewrite steps : 2271 0.64/0.68 # ...of those cached : 2121 0.64/0.68 # Propositional unsat checks : 0 0.64/0.68 # Propositional check models : 0 0.64/0.68 # Propositional check unsatisfiable : 0 0.64/0.68 # Propositional clauses : 0 0.64/0.68 # Propositional clauses after purity: 0 0.64/0.68 # Propositional unsat core size : 0 0.64/0.68 # Propositional preprocessing time : 0.000 0.64/0.68 # Propositional encoding time : 0.000 0.64/0.68 # Propositional solver time : 0.000 0.64/0.68 # Success case prop preproc time : 0.000 0.64/0.68 # Success case prop encoding time : 0.000 0.64/0.68 # Success case prop solver time : 0.000 0.64/0.68 # Current number of processed clauses : 341 0.64/0.68 # Positive orientable unit clauses : 47 0.64/0.68 # Positive unorientable unit clauses: 4 0.64/0.68 # Negative unit clauses : 79 0.64/0.68 # Non-unit-clauses : 211 0.64/0.68 # Current number of unprocessed clauses: 1689 0.64/0.68 # ...number of literals in the above : 3794 0.64/0.68 # Current number of archived formulas : 0 0.64/0.68 # Current number of archived clauses : 156 0.64/0.68 # Clause-clause subsumption calls (NU) : 33263 0.64/0.68 # Rec. Clause-clause subsumption calls : 16575 0.64/0.68 # Non-unit clause-clause subsumptions : 451 0.64/0.68 # Unit Clause-clause subsumption calls : 3479 0.64/0.68 # Rewrite failures with RHS unbound : 0 0.64/0.68 # BW rewrite match attempts : 73 0.64/0.68 # BW rewrite match successes : 52 0.64/0.68 # Condensation attempts : 1359 0.64/0.68 # Condensation successes : 44 0.64/0.68 # Termbank termtop insertions : 90887 0.64/0.68 # Search garbage collected termcells : 7379 0.64/0.68 0.64/0.68 # ------------------------------------------------- 0.64/0.68 # User time : 0.131 s 0.64/0.68 # System time : 0.013 s 0.64/0.68 # Total time : 0.144 s 0.64/0.68 # Maximum resident set size: 3500 pages 0.64/0.68 0.64/0.68 # ------------------------------------------------- 0.64/0.68 # User time : 0.141 s 0.64/0.68 # System time : 0.017 s 0.64/0.68 # Total time : 0.158 s 0.64/0.68 # Maximum resident set size: 2388 pages 0.64/0.68 % E exiting 0.64/0.69 % E exiting 0.64/0.69 EOF